Interactive Genetic Algorithms with Individual Fitness Not Assigned by Human

نویسندگان

  • Dun-Wei Gong
  • Xin Yao
  • Jie Yuan
چکیده

Interactive genetic algorithms (IGAs) are effective methods to solve optimization problems with implicit or fuzzy indices. But human fatigue problem, resulting from evaluation on individuals and assignment of their fitness, is very important and hard to solve in IGAs. Aiming at solving the above problem, an interactive genetic algorithm with an individual fitness not assigned by human is proposed in this paper. Instead of assigning an individual fitness directly, we record time to choose an individual from a population as a satisfactory or unsatisfactory one according to sensitiveness to it, and its fitness is automatically calculated by a transformation from time space to fitness space. Then subsequent genetic operation is performed based on this fitness, and offspring is generated. We apply this algorithm to fashion design, and the experimental results validate its efficiency.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimization of Plastic Injection Molding Process by Combination of Artificial Neural Network and Genetic Algorithm

Injection molding is one of the most important and common plastic formation methods. Combination of modeling tools and optimization algorithms can be used in order to determine optimum process conditions for the injection molding of a special part. Because of the complication of the injection molding process and multiplicity of parameters and their interactive effects on one another, analytical...

متن کامل

2 Interactive Genetic Algorithms with Individual ’ s Uncertain Fitness

Interactive genetic algorithms (IGAs), proposed in mid 1980s, are effective methods to solve an optimization problem with implicit or fuzzy indices (Dawkins, 1986). These algorithms combine traditional evolution mechanism with a user’s intelligent evaluation, and the user assigns an individual’s fitness rather than a function that is difficult or even impossible to explicitly express. Up to now...

متن کامل

Genetic Programming with User-Driven Selection: Experiments on the Evolution of Algorithms for Image Enhancement

In this paper we present an approach to the interactive development of programs for image enhancement with Genetic Programming (GP) based on pseudocolour transformations. In our approach the user drives GP by deciding which individual should be the winner in tournament selection. The presence of the user does not only allow running GP without a fitness function but it also transforms GP into a ...

متن کامل

A Comparison of Three Fitness Prediction Strategies for Interactive Genetic Algorithms

The human fatigue problem is one of the most significant problems encountered by interactive genetic algorithms (IGA). Different strategies have been proposed to address this problem, such as easing evaluation methods, accelerating IGA convergence via speedup algorithms, and fitness prediction. This paper studies the performance of fitness prediction strategies. Three prediction schemes, the ne...

متن کامل

Evaluation of sequential, multi-objective, and parallel interactive genetic algorithms for multi-objective optimization problems†

Evolutionary Computation (EC) is the field of computational systems that use ideas and get inspiration from natural evolution [1]. Genetic Algorithms (GA) fall into the category of EC. GA are a type of search and optimization algorithm based on the mechanisms of genetics and natural selection. The canonical form of GA encodes each candidate solution to a given problem as a binary, integer, or r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. UCS

دوره 15  شماره 

صفحات  -

تاریخ انتشار 2009